TRB exam online practice test for Computer Science and Engineering dept provides you with ample practice material for TRB exam preparation for cse department which adheres to the real exam format. Each TRB - CSE exam practice test has 10 questions. After completing click on to the COMPLETE TEST to know the score and the correct answers.


Computer Science and Engineering - TRB Online Practice Test - 8

  • Online Practice Test - CSE
   

1.
  ------------provides a method for the general public to access files on the remote sites .
  • A.   TCP
  •  
  • B.   Anonymous FTP
  •  
  • C.   UDP
  •  
  • D.   TELNET
  Options: A    B    C    D   
   
 
   

2.
  Which of these generate inelastic network traffic?.
  • A.   e-mail
  •  
  • B.   Instant messaging
  •  
  • C.   Streaming multimedia
  •  
  • D.   Web documents
  Options: A    B    C    D   
   
   

3.
  Type of ICMP messages used by ping program:.
  • A.   0,3
  •  
  • B.   0,8
  •  
  • C.   3,8
  •  
  • D.   8,9
  Options: A    B    C    D   
   
 
   

4.
  The most efficient data structure used for implementing routing tale is :.
  • A.   Tree
  •  
  • B.   Graph
  •  
  • C.   Trie
  •  
  • D.   Binary trie
  Options: A    B    C    D   
   
   

5.
  The most efficient algorithm for finding the number of connected components in an undirected graph on n vertices and m edges has time complexity:.
  • A.   \?(n)
  •  
  • B.   \?(m)
  •  
  • C.   \?(m + n)
  •  
  • D.   \?(mn)
  Options: A    B    C    D   
   
 
   

6.
  Binary search algorithm cannot be applied to :.
  • A.   Sorted linked list
  •  
  • B.   Sorted binary tree
  •  
  • C.   Sorted linear array
  •  
  • D.   pointer array
  Options: A    B    C    D   
   
   

7.
  Which is not a representation of intermediate representation?.
  • A.   Syntax tree
  •  
  • B.   Postfix notation
  •  
  • C.   Three address code
  •  
  • D.   Parse tree
  Options: A    B    C    D   
   
 
   

8.
  A register descriptor: .
  • A.   Keeps track of the usage of a register
  •  
  • B.   Keeps track of what is currently the each register
  •  
  • C.   Keeps track of the address of each register
  •  
  • D.   Keeps track of the location where the current value of the name can be found at runtime
  Options: A    B    C    D   
   
   

9.
  All information required for a single activation of a procedure are present in:.
  • A.   Stack
  •  
  • B.   Tree
  •  
  • C.   Environment
  •  
  • D.   Activation record
  Options: A    B    C    D   
   
 
   

10.
  assuming that each node of the B tree is 69% full and the search field is non ordering key field, B-tree is constructed on the field with p=23, on the average the number of pointers and search key fields would be.
  • A.   16,15
  •  
  • B.   16,16
  •  
  • C.   15,15
  •  
  • D.   15,16
  Options: A    B    C    D   
   

Complete Test
tnscholars.com

 

 

 

tnscholars.com.